The Cocke-Younger-Kasami algorithm for cyclic strings
نویسنده
چکیده
The chain-code representation of contours is widely used in syntactic shape recognition. However the ignorance of a starting point makes the time complexity of traditional parsers increase in one order. This paper describes a technique for adapting any Cock-Younger-Kasami context-free parser in order to use it with cyclic strings. The parsers obtained with this technique have the same time and space complexity as the original one (usually O(n3)).
منابع مشابه
A formalisation of the Cocke-Younger-Kasami algorithm
The theory provides a formalisation of the Cocke-Younger-Kasami algorithm [1] (CYK for short), an approach to solving the word problem for context-free languages. CYK decides if a word is in the languages generated by a context-free grammar in Chomsky normal form. The formalized algorithm is executable.
متن کاملAn Alternative Formulation of Cocke-Younger-Kasami's Algorithm
− We provide a reformulation of Cocke−Younger−Kasami’s algorithm for recognizing context-free languages in which there are no references either to indices of table entries or to the length of the input string. Some top-down analogues of this functional approach are discussed as well.
متن کاملThe CYK -Approach to Serial and Parallel Parsing
Traditional parsing methods for general context-free grammars have been re-investigated in order to see whether they can be adapted to a parallel processing view. In this paper we discuss sequential and parallel versions of the Cocke-Younger-Kasami (CYK) parsing algorithm. The algorithms that are considered turn out to be suitable for implementations ranging from environments with a small numbe...
متن کاملMemoisation of Categorial Proof Nets: Parallelism in Categorial Processing
We introduce a method of memoisationof categorial proof nets. Exploiting the planarity of non-commutative proof nets, and uniiability as a correctness criterion, parallelism is simulated through construction of a proof net matrix of most general uniiers for modules, in a manner analogous to the Cocke-Younger-Kasami algorithm for context free grammar.
متن کاملCertified CYK parsing of context-free languages
We report a work on certified parsing for context-free grammars. In our development we implement the Cocke–Younger–Kasami parsing algorithm and prove it correct using the Agda dependently typed programming language.
متن کامل